Macro forest transducers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Macro forest transducers

Xml documents conceptually are not trees, but forests. Therefore, we extend the concept of macro tree transducers (mtt’s) to a transformation formalism of forests, macro forest transducers (mft’s). We show that mft’s form a strict superset of mtt’s operating on forests (represented as binary trees). On the other hand, the transformation of every mft can be simulated by the composition of two mt...

متن کامل

Macro Tree Transducers

Macro tree transducers are a combination of top-down tree transducers and macro grammars. They serve as a model for syntax-directed semantics in which context information can be handled. In this paper the formal model of macro tree transducers is studied by investigating typical automata theoretical topics like composition, decomposition, domains, and ranges of the induced translation classes. ...

متن کامل

Multi-Return Macro Tree Transducers

An extension of macro tree transducers is introduced with the capability of states to return multiple trees at the same time. Under call-by-value semantics, the new model is strictly more expressive than call-by-value macro tree transducers, and moreover, it has better closure properties under composition.

متن کامل

Macro Tree Transducers in Treebag

Treebag is a software for experimenting with formal models in Computer Science, one type of such models being tree transducers. Tree transducers translate input trees to output trees, a mechanism used in e.g. compilers and picture generation. The top-down tree transducer is one of the formal models implemented as a component in Treebag. Compared to the top-down tree transducer, the macro tree t...

متن کامل

Towards Practical Typechecking for Macro Tree Transducers

Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step toward an implementation of mtt typechecker that has a practical efficiency. Our approach is to represent an input type obtained from a backward inference as an alternating tree automaton, in a style similar to Tozawa’s X...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2004

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2003.05.001